package leetcode._0274;

/**
 * 274. H-Index
 * Medium
 *
 * 445
 *
 * 769
 *
 * Favorite
 *
 * Share
 * Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
 *
 * According to the definition of h-index on Wikipedia: "A scientist has index h if h of his/her N papers have at least h citations each, and the other N − h papers have no more than h citations each."
 *
 * Example:
 *
 * Input: citations = [3,0,6,1,5]
 * Output: 3
 * Explanation: [3,0,6,1,5] means the researcher has 5 papers in total and each of them had
 *              received 3, 0, 6, 1, 5 citations respectively.
 *              Since the researcher has 3 papers with at least 3 citations each and the remaining
 *              two with no more than 3 citations each, her h-index is 3.
 * Note: If there are several possible values for h, the maximum one is taken as the h-index.
 */

import java.util.Arrays;

/**
 * https://leetcode.com/problems/h-index/
 */

/**
 * https://leetcode.com/submissions/detail/267729816/
 */
public class Solution {

    /**
     * [4,0,6,1,5] ==> [0,1,4,5,6]
     */
    /**
     * 简单点，也是是所，H在0到citations.length之间
     * @param citations
     * @return
     */

    public int hIndex(int[] citations) {
        Arrays.sort(citations);
        int hIndex = 0;
        for (int i = 0; i < citations.length; i++) {
            if (citations[i] > 0){
                if (citations.length - i > citations[i]) {
                    hIndex = citations.length - i;
                } else {
                    hIndex = citations.length - i;
                    return hIndex;
                }
            }
        }
        return hIndex;
    }
}
